منابع مشابه
Classical mixed partitions
Through a method given in [3], a mixed partition of PG(2n− 1, q2) can be used to construct a (2n− 1)-spread of PG(4n− 1, q) and, hence, a translation plane of order q2n. A mixed partition in this case is a partition of the points of PG(2n− 1, q2) into PG(n− 1, q2)’s and PG(2n− 1, q)’s which we call Baer subspaces. In this paper, we completely classify the mixed partitions which generate regular...
متن کاملMixed partitions and related designs
We define a mixed partition of Π = PG(d, qr) to be a partition of the points of Π into subspaces of two distinct types, for instance, a partition of PG(2n− 1, q2) into (n− 1)-spaces and Baer subspaces of dimension 2n− 1. In this paper we provide a group theoretic method for constructing a robust class of such partitions. It is known that a mixed partition of PG(2n−1, q2) can be used to construc...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملMultistage Robust Mixed-Integer Optimization with Adaptive Partitions
We present a new partition-and-bound method for multistage adaptive mixed integer optimization (AMIO) problems that extends previous work on finite adaptability. The approach analyzes the optimal solution to a static (non-adaptive) version of an AMIO problem to gain insight into which regions of the uncertainty set are restricting the objective function value. We use this information to constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00058-8